Computational Aspects of Silicate Networks

In this paper we consider a new interconnection network motivated by molecular structure of a chemical compound SiO4. The different forms of silicates available in nature lead to the introduction of the silicate networks. We investigate various parameters related to this network. We provide an addressing scheme for the nodes of the network and also an algorithm that enables us to draw the silicate network in the two dimensional plane aesthetically. Certain properties of this network are brought out using classical geometry. We also identify edge disjoint cycles of this network. The embedding of the honeycomb and hexagonal networks into silicates is studied in order to demonstrate that they are all computationally equivalent.